Algorithm and Planning Device for CPU Loading in Multiprocessor Systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

applying genetic algorithm for an integrated supply and production/distribution planning in assembly systems

abstract: an efficient supply chain system operates under a strategy to minimize costs by integrating the different functions inside the system and by meeting customer demands in time. in this paper, an integrated supply-production and distribution planning (spdp) is considered despite the fact that in most of the papers, part of the supply chain has been studied, not all parts. therefore, we d...

متن کامل

A combined Partitioning and Scheduling Algorithm for heterogeneous Multiprocessor Systems

The paper presents an extension of co-synthesis for data dominated applications to include reactive processes. The extension allows for rate constraints as used in data dominated applications as well as minimum and maximum time constraints for communication and I/O which is required to define reactive behavior of control tasks. A co-synthesis approach is proposed which differentiates global pro...

متن کامل

A Modified Genetic Algorithm for Task Scheduling in Multiprocessor Systems

The impressive proliferation in the use of multiprocessor systems these days in a great variety of applications is the result of many breakthroughs over the last two decade. In these multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital for achieving a high performance. This problem is exactly known very hard ...

متن کامل

A Comparison of Basic CPU Scheduling Algorithms for Multiprocessor UNIX

In this paper, we present the results of a simulation study comparing three basic algorithms that schedule independent tasks in multiprocessor versions of Unix. Two of these algorithms, namely Central Queue and Initial Placement, are obvious extensions to the standard uniprocessor scheduling algorithm and are in use in a number of multiprocessor systems. A third algorithm, Take, is a variation ...

متن کامل

Hierarchical Multiprocessor CPU Reservations for the Linux Kernel

This paper presents ongoing work in the development of a scheduling framework that will improve the service guarantees for soft real-time applications deployed on Linux. The scheduler has been designed around the current kernel infrastructure, trying to keep the changes minimal, and basing the scheduling policy on strong theoretical results. The main goal is to achieve hierarchical distribution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Southwest State University

سال: 2019

ISSN: 2686-6757,2223-1560

DOI: 10.21869/2223-1560-2019-23-5-161-174